Convex Matching Pursuit for Large-Scale Sparse Coding and Subset Selection
نویسندگان
چکیده
In this paper, a new convex matching pursuit scheme is proposed for tackling large-scale sparse coding and subset selection problems. In contrast with current matching pursuit algorithms such as subspace pursuit (SP), the proposed algorithm has a convex formulation and guarantees that the objective value can be monotonically decreased. Moreover, theoretical analysis and experimental results show that the proposed method achieves better scalability while maintaining similar or better decoding ability compared with state-of-the-art methods on large-scale problems.
منابع مشابه
Learning Sparse Overcomplete Codes for Images
Images can be coded accurately using a sparse set of vectors from a learned overcomplete dictionary, with potential applications in image compression and feature selection for pattern recognition. We present a survey of algorithms that perform dictionary learning and sparse coding and make three contributions. First, we compare our overcomplete dictionary learning algorithm (FOCUSS-CNDL) with o...
متن کاملJust Relax: Convex Programming Methods for Subset Selection and Sparse Approximation
Subset selection and sparse approximation problems request a good approximation of an input signal using a linear combination of elementary signals, yet they stipulate that the approximation may only involve a few of the elementary signals. This class of problems arises throughout electrical engineering, applied mathematics and statistics, but small theoretical progress has been made over the l...
متن کاملHierarchical Matching Pursuit for Image Classification: Architecture and Fast Algorithms
Extracting good representations from images is essential for many computer vision tasks. In this paper, we propose hierarchical matching pursuit (HMP), which builds a feature hierarchy layer-by-layer using an efficient matching pursuit encoder. It includes three modules: batch (tree) orthogonal matching pursuit, spatial pyramid max pooling, and contrast normalization. We investigate the archite...
متن کاملEE 381 V : Large Scale Learning Spring 2013 Lecture 21 — April 2
In the past few lectures we have been studying the problem of sparse signal reconstruction from a small number of noiseless linear measurements. The objective is to recover an unknown, k-sparse, n-dimensional vector x from a measurement vector y = Ax ∈ R, which is a linear transformation of x by a known m× n matrix A, where m < n. We have presented various heuristics for sparse signal recovery,...
متن کاملA low complexity model adaptation approach involving sparse coding over multiple dictionaries
The work presented in this paper describes a novel on-line adaptation approach for extremely low adaptation data scenario. The proposed approach extends a similar redundant dictionary based approach reported recently in literature. In this work, the orthogonal matching pursuit (OMP) algorithm is used for bases selection instead of the matching pursuit (MP). This helps in avoiding the selection ...
متن کامل